To Weight or Not to Weight: Where is the Question?
نویسندگان
چکیده
We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and very general) deenition of niceness, we show that if a nice weighted problem is hard to approximate within r, then its polynomially bounded weighted version is hard to approximate within r ? o(1). Then we turn our attention to speciic problems, and we show that the un-Max Exact kSat are exactly as hard to approximate as their weighted versions. We note in passing that Min Vertex Cover is exactly as hard to approximate as Min Sat. In order to prove the reductions for Max 2Sat, Max Cut, Max Directed Cut, and Max E3Sat we introduce the new notion of \mixing" set and we give an explicit construction of such sets. These reductions give new non-approximability results for these problems.
منابع مشابه
بهبود پروتکل AODV جهت مقابله با حملات کرمچاله در شبکههای اقتضایی
Mobile Ad hoc Networks (MANET) are vulnerable to both active and passive attacks. The wormhole attack is one of the most severe security attacks in wireless ad hoc networks, an attack that can be mounted on a wide range of wireless network protocols without compromising any cryptographic quantity or network node. In Wormhole attacks, one malicious node tunnels packets from its location to the ...
متن کاملTechniques to carry weight loads and resist against bending in conical shells, cases in Kashan
Little has been written about the structural behavior of conical shells, while conical shells’ construction techniques due to the high rise and small span has always required special attention throughout the history of Islamic architecture. This paper aims to examine how conical shells bear weight loads and resist against bending through a qualitative analysis. After proving that ‘r...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملTHE ANALOGUE OF WEIGHTED GROUP ALGEBRA FOR SEMITOPOLOGICAL SEMIGROUPS
In [1,2,3], A. C. Baker and J.W. Baker studied the subspace Ma(S) of the convolution measure algebra M, (S) of a locally compact semigroup. H. Dzinotyiweyi in [5,7] considers an analogous measure space on a large class of C-distinguished topological semigroups containing all completely regular topological semigroups. In this paper, we extend the definitions to study the weighted semigroup ...
متن کاملMoisture Diffusion Properties of Fabric Composite (Glass Fiber/Epoxy Resin)
In this study, the effect of hygrothermal conditioning on the moisture diffusion properties of the fabric composite (glass fiber/epoxy resin) was investigated. The water uptake of the specimens conditioned in humid environment at different relative humidities (0, 60 and 96 % r.h) at constant temperature (60°C) was evaluated by weight gain measurements. The moisture diffusion properties of the f...
متن کاملEffects of deficit irrigation and groundwater depth on root growth of direct seeding rice in a column experiment
Rice is an essential crop in Iran that is grown mostly in areas where depth to groundwater is low. Root growth and water uptake of rice under shallow groundwater has not been thoroughly studied. This experiment was conducted to determine the lowland rice (cv. Ghasrodashti) root distribution above shallow groundwater in relation to deficit irrigation and groundwater depth in cylindrical gre...
متن کامل